ar X iv : c s / 07 01 11 1 v 1 [ cs . P L ] 1 7 Ja n 20 07 Some Issues on Incremental Abstraction - Carrying Code

نویسنده

  • Germán Puebla
چکیده

ion-Carrying Code Elvira Albert, Puri Arenas, and Germán Puebla 1 Complutense University of Madrid, {elvira,puri}@sip.ucm.es 2 Technical University of Madrid, [email protected] Abstract. Abstraction-Carrying Code (ACC) has recently been proposed as a framework for proof-carrying code (PCC) in which the code supplier provides a program together with an abstraction (or abstract Abstraction-Carrying Code (ACC) has recently been proposed as a framework for proof-carrying code (PCC) in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. The abstraction thus plays the role of safety certificate and its generation (and validation) is carried out automatically by a fixed-point analyzer. Existing approaches for PCC are developed under the assumption that the consumer reads and validates the entire program w.r.t. the full certificate at once, in a non incremental way. In this abstract, we overview the main issues on incremental ACC. In particular, in the context of logic programming, we discuss both the generation of incremental certificates and the design of an incremental checking algorithm for untrusted updates of a (trusted) program, i.e., when a producer provides a modified version of a previously validated program. By update, we refer to any arbitrary change on a program, i.e., the extension of the program with new predicates, the deletion of existing predicates and the replacement of existing predicates by new versions for them. We also discuss how each kind of update affects the incremental extension in terms of accuracy and correctness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : c s / 07 01 11 2 v 1 [ cs . I T ] 1 7 Ja n 20 07 ( l , s ) − Extension of Linear Codes

We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n, k. Among these new codes there is an optimal ternary [88, 8, 54]3 code. We develop an algorithm, which starts with already good codes C , i.e. codes with high minimum distance d for given length n and dimensio...

متن کامل

ar X iv : h ep - t h / 01 12 11 4 v 2 2 1 Ja n 20 02 CCNY - HEP - 01 / 10 Gravitational fields on a noncommutative space

Noncommutative three-dimensional gravity can be described in terms of a noncommuta-tive Chern-Simons theory. We extend this structure and also propose an action for gravi-tational fields on an even dimensional noncommutative space. The action is worked out in some detail for fields on a noncommutative CP 2 and on S 4 .

متن کامل

ar X iv : h ep - p h / 05 01 11 9 v 1 1 4 Ja n 20 05 1 πη pair hard electroproduction and exotic hybrid mesons

We show that hard electroproduction is a promising way to study exotic hybrid mesons, in particular through the hybrid decay channel H → πη. We discuss the πη generalized distribution amplitude, calculate the production amplitude and propose a forward-backward asymmetry as a signal for the hybrid meson production.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007